789. 逃脱阻碍者

为保证权益，题目请参考 789. 逃脱阻碍者(From LeetCode).

解决方案1

Python

# 789. 逃脱阻碍者
# https://leetcode-cn.com/problems/escape-the-ghosts/
from typing import List


class Solution:
    def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool:
        source = [0, 0]
        distance = manhattanDistance(source, target)
        return all(manhattanDistance(ghost, target) > distance for ghost in ghosts)


def manhattanDistance(point1: List[int], point2: List[int]) -> int:
    return abs(point1[0] - point2[0]) + abs(point1[1] - point2[1])


if __name__ == "__main__":
    solution = Solution()